An Allocation-Routing Optimization Model for Integrated Solid Waste Management

Integrated smart waste management (ISWM) is an innovative and technologically advanced approach to managing and collecting waste. It is based on the Internet of Things (IoT) technology, a network of interconnected devices that communicate and exchange data. The data collected from IoT devices helps municipalities to optimize their waste management operations. They can use the information to schedule waste collections more efficiently and plan their routes accordingly. In this study, we consider an ISWM framework for the collection, recycling, and recovery steps to improve the performance of the waste system. Since ISWM typically involves the collaboration of various stakeholders and is affected by different sources of uncertainty, a novel multi-objective model is proposed to maximize the probabilistic profit of the network while minimizing the total travel time and transportation costs. In the proposed model, the chance-constrained programming approach is applied to deal with the profit uncertainty gained from waste recycling and recovery activities. Furthermore, some of the most proficient multi-objective meta-heuristic algorithms are applied to address the complexity of the problem. For optimal adjustment of parameter values, the Taguchi parameter design method is utilized to improve the performance of the proposed optimization algorithm. Finally, the most reliable algorithm is determined based on the Best Worst Method (BWM)

Industry 4.0 in Waste Management: An Integrated IoT-Based Approach for Facility Location and Green Vehicle Routing

The increasing production of solid waste rate in urban areas plays a critical role in sustainable development. To mitigate the adverse effects of waste and enhance waste management efficiency, this paper introduces a holistic approach that notably reduces the overall cost while mitigating social and environmental impacts. Central to the system's efficacy is the critical process of waste sorting, which enhances the output value of the waste management system. While previous studies have not extensively addressed simultaneous waste collection and sorting, this paper provides an innovative integrated framework. This approach Integrates waste collection with various bins, followed by their transfer to separation centers. At these centers, waste is categorized into organic and non-organic varieties, which are then dispatched to a recovery center at the second level. In the context of optimizing the routes at both levels, this paper presents a green, multi-objective location-allocation model. This model is designed to optimize the number and location of separation center facilities. Since the routing problem is influenced by the facility location model, it is addressed as a multi-depot green vehicle routing problem, integrating real-time information from IoT-equipped bins. This paper also proposes the vehicle routing problem with a split pickup, aiming to minimize cost, CO2 emissions, and visual pollution. The mathematical models introduced to formulate the problem are solved using the GAMS optimization software to apply an exact method, while Social Engineering Optimization and Keshtel algorithms are deployed to solve the routing problem. The proposed approach offers a comprehensive and sustainable solution to waste management, filling crucial gaps in current research and practice

A dynamic approach for the multi-compartment vehicle routing problem in waste management

Urban areas worldwide face a significant environmental challenge which is increasing municipal solid waste rate. Addressing its negative consequences necessitates advancements in waste management systems. Although the previous research focused on the static routing approach in the collection phase, this paper adds a dynamic municipal solid waste collection scheme to optimize vehicle routing, accounting for fluctuations in waste generation and changes in transportation systems. This study employs, for the first time, the application of a discrete choice model (DCM) to streamline the process of re-optimization in dynamic vehicle routing problems (DVRP). At each decision epoch, DCM is applied to determine the likelihood of choosing the next geographical zone to visit bins based on current waste generation levels and traveling costs. Moreover, the multi-compartment vehicles are considered to preserve waste segregation during transportation, thereby increasing operational efficiency and regulatory compliance. Another contribution of this paper is to determine visiting priority for each bin by adjusting the time window based on the threshold waste level. Hence, this paper proposes a framework for sustainable, efficient, and effective waste management practices by integrating the benefits of dynamic and multi-compartment routing. Furthermore, a hybrid Genetic and Particle Swarm Optimization algorithm has been designed to find the best solution for the studied problem as well as some of the latest and most proficient metaheuristic algorithms. Finally, the Best Worst Method is applied to find the best-proposed algorithm to solve the presented problem, indicating that the hybrid algorithm has the highest performance in providing high-quality route plans

Designing a multi-period dynamic electric vehicle production-routing problem in a supply chain considering energy consumption

The coordinated decision-making approach for considering sequential activities of the supply chain results in additional benefits by optimizing production, inventory, and distribution operations. Accordingly, this paper proposes a mixed integer linear mathematical model to optimize a multi-period production routing problem utilizing electric vehicles. The proposed model optimizes the total cost associated with fixed and variable production, holding inventory, and routing, including the fixed cost of utilizing electric vehicles and travel time. However, mileage limitation is one of the main restrictions of utilizing electric vehicles in performing deliveries which is strongly affected by the consumed energy. Although optimization of the routes of vehicles can facilitate using them, considering the variation of travel speed network links during different times of the day because of traffic conditions can obviously affect the required energy to perform the assigned deliveries. To the best of our knowledge, this paper is the first to study simultaneous multi-period dynamic production routing problems using a set of heterogenous electric vehicles whose travel time of links can vary by dividing each production period into several hourly time intervals to capture different traffic conditions. Finally, a series of capable and hybrid metaheuristic algorithms are designed and implemented to solve this problem in a real-case dimension, and all proposed algorithms are compared

A platform to optimize urban deliveries with e-vans Dealing with vehicles range and batteries recharge

The paper reports the results of a research targeted to develop a Decision Support System (DSS) for planning and operation of urban deliveries carried out with electric vans. The research was included within the 2019-21 Research Program for the Electric System, coordinated by the Italian Ministry for the Ecological Transition, and has been performed by ENEA, the Italian Agency for Energy, New Technologies and Sustainable Development, and “La Sapienza” University of Rome. The new DSS is based on meta-heuristics algorithms capable to manage a generic set of goods to be delivered by means of a generic fleet of electric vans, with the objective of minimizing the overall cost of the daily operation. The algorithm considers all the physical constraints, including vehicles batteries capacity. It is assumed that fast recharges can be performed during the delivery tours. For the real-time operation, a monitoring system of the vehicle fleet, road network and recharge stations is assumed, based on IoT technologies, in order to detect possible unexpected events and manage them in the best way, according to the available resources time by time. The paper describes the DSS general architecture, the optimization algorithms and the recovery procedures and shows results for two testbeds